Solving Norm Form Equations Via Lattice Basis Reduction
نویسندگان
چکیده
منابع مشابه
Solving Norm Form Equations Via Lattice Basis Reduction
The author uses irrationality and linear independence measures for certain algebraic numbers to derive explicit upper bounds for the solutions of related norm form equations. The Lenstra-Lenstra-Lovász lattice basis reduction algorithm is then utilized to show that the integer solutions to NK/Q(x 4 √ N4 − 1 + y 4 √ N4 + 1 + z) = ±1 (where K = Q( 4 √ N4 − 1, 4 √ N4 + 1)) are given by (x, y, z) =...
متن کاملLattice Basis Reduction in Infinity Norm
In the high-tech world of today, the demand for security is constantly rising. That is why identifying hard computational problems for cryptographical use has become a very important task. It is crucial to find computational problems, which complexity could provide a basis for the security of the cryptosystems. However, there are only very few hard computational problems that are useful for cry...
متن کاملExtended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x1, . . . , xm for the equation s = gcd (s1, . . . , sm) = x1s1 + · · · + xm...
متن کاملParameterized norm form equations with arithmetic progressions
Buchmann and Pethő [5] observed that following algebraic integer 10 + 9α + 8α + 7α + 6α + 5α + 4α, with α = 3 is a unit. Since the coefficients form an arithmetic progressions they have found a solution to the Diophantine equation (1) NK/Q(x0 + αx1 + · · ·+ x6α) = ±1, such that (x0, . . . , x6) ∈ Z is an arithmetic progression. Recently Bérczes and Pethő [3] considered the Diophantine equation ...
متن کاملNorm Form Equations and Continued Fractions
We consider the Diophantine equation of the form x2−Dy2 = c, where c ∣∣ 2D, gcd(x, y) = 1, and provide criteria for solutions in terms of congruence conditions on the fundamental solution of the Pell Equation x2 − Dy2 = 1. The proofs are elementary, using only basic properties of simple continued fractions. The results generalize various criteria for such solutions, and expose the central norm,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 1996
ISSN: 0035-7596
DOI: 10.1216/rmjm/1181072024